Network Flows and Combinatorial Optimization
نویسنده
چکیده
منابع مشابه
Network flows and combinatorial matrix theory
This note gives a very brief introduction to the theory of network flows and some related topics in combinatorial matrix theory. 1 Network flow theory Network flow theory is a mathematical treatment of flows in networks. Actually, the classical and basic treatment of this area is the pioneering monograph by L.R. Ford and D.R. Fulkerson called Flows in networks [9]. A more recent, and highly rec...
متن کاملAn Introduction to Network Flows over Time
We give an introduction into the fascinating area of flows over time—also called “dynamic flows” in the literature. Starting from the early work of Ford and Fulkerson on maximum flows over time, we cover many exciting results that have been obtained over the last fifty years. One purpose of this chapter is to serve as a possible basis for teaching network flows over time in an advanced course o...
متن کاملA Systematic Method to Analyze Transport Networks: Considering Traffic Shifts
Current network modeling practices usually assess the network performance at specified time interval, i.e. every 5 or 10 years time horizon. Furthermore, they are usually based on partially predictable data, which are being generated through various stochastic procedures. In this research, a new quantitative based methodology which combines combinatorial optimization modeling and transportation...
متن کاملInteger Network Synthesis Problem for Hop Constrained Flows
Hop constraint is associated with modern communication network flows. We consider the problem of designing an optimal undirected network with integer-valued edge-capacities that meets a given set of single-commodity, hop-constrained network flow value requirements. We present a strongly polynomial, combinatorial algorithm for the problem with value of hop-parameter equal to three when values of...
متن کاملA survey of combinatorial maximum flow algorithms on a network with gains
Network optimization experienced a fast development, during the last few decades. While a traditional network assumes that each flow is conserved on every arc, a flow along an arc may increase or decrease by a fixed factor during its traversal of that arc in a generalized network. This paper surveys combinatorial maximum flow algorithms on the generalized network and compares algorithms for tra...
متن کامل